Online Scheduling on a Single Machine with Grouped Processing Times
نویسندگان
چکیده
منابع مشابه
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
This paper investigates the semi-online version of scheduling problemP ||Cmax on a three-machine system.We assume that all jobs have their processing times between p and rp (p> 0, r 1).We give a comprehensive competitive ratio of LS algorithm which is a piecewise function on r 1. It shows that LS is an optimal semi-online algorithm for every r ∈ [1, 1.5], [√3, 2] and [6,+∞).We further present a...
متن کاملBicriterion Single Machine Scheduling with Resource Dependent Processing Times
A bicriterion problem of scheduling jobs on a single machine is studied. The processing time of each job is a linear decreasing function of the amount of a common discrete resource allocated to the job. A solution is specified by a sequence of the jobs and a resource allocation. The quality of a solution is measured by two criteria, F1 and F2. The first criterion is the maximal or total (weight...
متن کاملSingle-machine scheduling with time window-dependent processing times
In the one-machine scheduling problems analysed in this paper, the processing time of a job depends on the time at which the job is started. More precisely, the horizon is divided into time windows and with each one a coe cient is associated that is used to determine the actual processing time of a job starting in it. Two models are introduced, and one of them has direct connections with models...
متن کاملSingle Machine Scheduling with Controllable Processing Times by submodular Optimization
In scheduling with controllable processing times the actual processing time of each job is to be chosen from the interval between the smallest (compressed or fully crashed) value and the largest (decompressed or uncrashed) value. In the problems under consideration, the jobs are processed on a single machine and the quality of a schedule is measured by two functions: the maximum cost (that depe...
متن کاملSINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2015
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2015/805294